Polar code encoding method and device

ABSTRACT

Disclosed in an embodiment of the present invention are a polar code encoding method and device, the method comprising: utilizing a common information bit set to represent each of m polar code blocks, the polar codes in each polar code block having the same code length and different code rates, and m being greater than or equal to 2; according to the common information bit set corresponding to the polar code block, acquiring an information bit set corresponding to each polar code in the polar code block; and according to the information bit set corresponding to each polar code in the polar code block, conducting polar code encoding on information to be encoded, thus reducing polar code representation overhead, and solving the problem in the prior art of excessively high polar code representation overhead.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No.16/007,966, filed on Jun. 13, 2018, which is a continuation of U.S.patent application Ser. No. 15/151,320, filed on May 10, 2016, now U.S.Pat. No. 10,020,913. The U.S. patent application Ser. No. 15/151,320 isa continuation of International Patent Application No.PCT/CN2013/086871, filed on Nov. 11, 2013. All of the afore-mentionedpatent applications are hereby incorporated by reference in theirentireties.

TECHNICAL FIELD

The present disclosure relates to the field of communication, andparticularly to a polar code encoding method and device.

BACKGROUND

In a communication system, channel encoding is generally used to improvereliability of data transmission and ensure communication quality. APolar code is a good code which can achieve Shannon capacity bytheoretical proof and has a low encoding and decoding complexity. If thecode length is short, the performance of conventional successivecancellation (SC) decoding is worse than performances of a low densityparity check (LDPC) code and a Turbo Code. In a case of decoding withlist codes, the performance of the Polar code with medium code length isbetter than performances of the LDPC code or the Turbo Code.

The Polar code is a linear block code, and the generator matrix thereofis G_(N). The process of Polar code encoding is x₁ ^(N)=u₁ ^(N)G_(N),where x₁ ^(N) is an output bit after encoding, u₁ ^(N) is an input bitbefore encoding, G_(N)=B_(N)F^(⊗) ^(n) . The code length N=2^(n), andn≥0. B_(N) is a transposed matrix such as a bit reversal matrix. F^(⊗n)is a Kronecker power of F, which is defined as F^(⊗n)=F⊗F^(⊗n) ⁻¹ ,where

$F = {\begin{bmatrix}1 & 0 \\1 & 1\end{bmatrix}.}$

The Polar code may be represented as (N,K,A,u_(A) _(c) ) with a coseccode, and the encoding process is x₁ ^(N)=u_(A)G_(N)(A)⊗u_(A) _(c)G_(N)(A^(c)). A is an information bit index set. G_(N)(A) is a submatrixobtained from a row, which corresponds to the index in the set A, inG_(N). G_(N)(A^(c)) is a submatrix obtained from a row, whichcorresponds to the index in the set A^(c), in G_(N). u_(A) _(c) isfrozen bits the number of which is (N−K), with N being the code lengthand K being the length of information bits. For simplicity, the frozenbit may be set to 0, and in this case, the above encoding process isbriefly described as x₁ ^(N)=u_(A)G_(N)(A).

In the conventional technology, a Polar code with a code length being Nand a code rate being R₁ is represented as (N,K₁,A₁), a second Polarcode with a code length being N and a code rate being R₂ is representedas (N,K₂,A₂), and a Polar code with a code length being N and a coderate being R₃ is represented as (N,K₃,A₃). Polar codes with a same codelength and different code rates are represented differently. Forexample, a first Polar code with the code length being 2048 and thenumber of information bits being 683 is represented as (2048, 683, A₁),where A₁ is a subset including 683 elements of a set {0, 1, 2, . . . ,2047}. A second Polar code with the code length being 2048 and thenumber of information bits being 1024 is represented as (2048, 1024,A₂), where A₂ is a subset including 1024 elements of the set {0, 1, 2, .. . , 2047}. A₁ and A₂ include a large number of same elements. However,in the conventional technology, the first Polar code and the secondPolar code need to be represented by A₁ and A₂ respectively, whichcauses a high overhead for representing the Polar code conventionally.

SUMMARY

A method and an apparatus for Polar code encoding are provided accordingto embodiments of the disclosure, in which encoding is performedaccording to representation of Polar codes with a same code length anddifferent code rates based on groups, and the overhead for representingthe Polar codes is greatly reduced.

To achieve the above object, technical solutions adopted in theembodiments of the disclosure are as follows.

In a first aspect, a method for Polar code encoding is provided. Themethod includes:

-   -   representing each Polar code group in m Polar code groups by a        common information bit set, where Polar codes in each Polar code        group have a same code length and different code rates, and m is        greater than or equal to 2;    -   obtaining an information bit set corresponding to each Polar        code in the Polar code group based on the common information bit        set corresponding to the Polar code group; and    -   performing Polar code encoding on information to be encoded        based on the information bit set corresponding to each Polar        code in the Polar code group.

In a first possible implementation of the first aspect, according to thefirst aspect, information bit sets respectively corresponding to allPolar codes with different code rates in each Polar code group includeat least one same element.

In a second possible implementation of the first aspect, according tothe first aspect or the first possible implementation of the firstaspect, the common information bit set corresponding to the Polar codegroup is a union of information bit sets respectively corresponding toall Polar codes with different code rates in the Polar code group, or isan information bit set corresponding to a Polar code with any code ratein the Polar code group.

In a second aspect, a method for Polar code encoding is provided. Themethod includes:

-   -   representing each Polar code group in m Polar code groups by a        common frozen bit set, where Polar codes in each Polar code        group have a same code length and different code rates, and m is        greater than or equal to 2;    -   obtaining a frozen bit set corresponding to each Polar code in        the Polar code group based on the frozen bit set corresponding        to the Polar code group; and    -   performing Polar code encoding on information to be encoded        based on the frozen bit set corresponding to each Polar code in        the Polar code group.

In a first possible implementation of the second aspect, in conjunctionwith the second aspect, frozen bit sets respectively corresponding toall Polar codes with different code rates in each Polar code groupinclude at least one same element.

In a second possible implementation of the second aspect, in conjunctionwith the second aspect or the first possible implementation of thesecond aspect, the common frozen bit set corresponding to the Polar codegroup is a union of frozen bit sets respectively corresponding to allPolar codes with different code rates in the Polar code group, or is afrozen bit set corresponding to a Polar code with any code rate in thePolar code group.

In a third aspect, an apparatus for Polar code encoding is provided,which includes:

-   -   a representing unit configured to represent each Polar code        group in m Polar code groups by a common information bit set,        where Polar codes in each Polar code group have a same code        length and different code rates, and m is greater than or equal        to 2;    -   an obtaining unit configured to obtain an information bit set        corresponding to each Polar code in the Polar code group based        on the common information bit set corresponding to the Polar        code group; and    -   an encoding unit configured to perform Polar code encoding on        information to be encoded based on the information bit set        corresponding to each Polar code in the Polar code group.

In a first possible implementation of the third aspect, in conjunctionwith the third aspect, information bit sets respectively correspondingto all Polar codes with different code rates in each Polar code groupinclude at least one same element.

In a second possible implementation of the third aspect, in conjunctionwith the third aspect or the first possible implementation of the thirdaspect, the common information bit set corresponding to the Polar codegroup is a union of information bit sets respectively corresponding toall Polar codes with different code rates in the Polar code group, or isan information bit set corresponding to a Polar code with any code ratein the Polar code group.

In a fourth aspect, an apparatus for Polar code encoding is provided,which includes:

-   -   a processor configured to:    -   represent each Polar code group in m Polar code groups by a        common information bit set, where Polar codes in each Polar code        group have a same code length and different code rates, and m is        greater than or equal to 2;    -   obtain a frozen bit set corresponding to each Polar code in the        Polar code group based on the common information bit set        corresponding to the Polar code group; and    -   perform Polar code encoding on information to be encoded based        on the information bit set corresponding to each Polar code in        the Polar code group.

In a first possible implementation of the fourth aspect, in conjunctionwith the fourth aspect, information bit sets respectively correspondingto all Polar codes with different code rates in each Polar code groupinclude at least one same element.

In a second possible implementation of the fourth aspect, in conjunctionwith the fourth aspect or the first possible implementation of thefourth aspect, the common information bit set corresponding to the Polarcode group is a union of information bit sets respectively correspondingto all Polar codes with different code rates in the Polar code group, oris an information bit set corresponding to a Polar code with any coderate in the Polar code group.

In a fifth aspect, an apparatus for Polar code encoding is provided,which includes:

-   -   a representing unit configured to represent each Polar code        group in m Polar code groups by a common frozen bit set, where        Polar codes in each Polar code group have a same code length and        different code rates, and m is greater than or equal to 2;    -   an obtaining unit configured to obtain an information bit set        corresponding to each Polar code in the Polar code group based        on the frozen bit set corresponding to the Polar code group; and    -   an encoding unit configured to perform Polar code encoding on        information to be encoded based on the frozen bit set        corresponding to each Polar code in the Polar code group.

In a first possible implementation of the fifth aspect, in conjunctionwith the fifth aspect, frozen bit sets respectively corresponding to allPolar codes with different code rates in each Polar code group includeat least one same element.

In a second possible implementation of the fifth aspect, in conjunctionwith the fifth aspect or the first possible implementation of the fifthaspect, the common frozen bit set corresponding to the Polar code groupis a union of frozen bit sets respectively corresponding to all Polarcodes with different code rates in the Polar code group, or is a frozenbit set corresponding to a Polar code with any code rate in the Polarcode group.

In a sixth aspect, an apparatus for Polar code encoding is provided,which includes:

-   -   a processor configured to:    -   represent each Polar code group in m Polar code groups by a        common frozen bit set, where Polar codes in each Polar code        group have a same code length and different code rates, and m is        greater than or equal to 2;    -   obtain a frozen bit set corresponding to each Polar code in the        Polar code group based on the frozen bit set corresponding to        the Polar code group; and    -   perform Polar code encoding on information to be encoded based        on the frozen bit set corresponding to each Polar code in the        Polar code group.

In a first possible implementation of the sixth aspect, in conjunctionwith the sixth aspect, frozen bit sets respectively corresponding to allPolar codes with different code rates in each Polar code group includeat least one same element.

In a second possible implementation of the sixth aspect, in conjunctionwith the sixth aspect or the first possible implementation of the sixthaspect, the common frozen bit set corresponding to the Polar code groupis a union of frozen bit sets respectively corresponding to all Polarcodes with different code rates in the Polar code group, or is a frozenbit set corresponding to a Polar code with any code rate in the Polarcode group.

In the methods and apparatuses for Polar code encoding according to theembodiments of the disclosure, each Polar code group in the m Polar codegroups is represented by a common information bit set or a common frozenbit set, where Polar codes in each Polar code group have a same codelength and different code rates, and m is greater than or equal to 2; aninformation bit set or a frozen bit set corresponding to each Polar codein the Polar code group is obtained based on the common information bitset or the common frozen bit set corresponding to the Polar code group,and Polar code encoding is performed on information to be encoded basedon the information bit set or the frozen bit set corresponding to eachPolar code in the Polar code group.

In this way, encoding is performed according to representation of Polarcodes with a same code length and different code rates based on groups,which greatly reduces the overhead for representing the Polar codes andaddresses the problem of large overhead for representing the Polar codesin the conventional technology, compared with the case that each Polarcode is represented by an independent information bit set or anindependent frozen bit set.

BRIEF DESCRIPTION OF THE DRAWINGS

In order to illustrate the technical solutions according to embodimentsof the disclosure or in the conventional technology, the drawings to beused in the description are described briefly herein.

FIG. 1 is a flow chart of a method for Polar code encoding according toan embodiment of the disclosure;

FIG. 2 is a schematic diagram of a common information bit set of eachPolar code group according to an embodiment of the disclosure;

FIG. 3 is a flow chart of another method for Polar code encodingaccording to an embodiment of the disclosure;

FIG. 4 is a schematic diagram of an apparatus for Polar code encodingaccording to an embodiment of the disclosure;

FIG. 5 is a schematic diagram of another apparatus for Polar codeencoding according to an embodiment of the disclosure;

FIG. 6 is a schematic diagram of another apparatus for Polar codeencoding according to an embodiment of the disclosure; and

FIG. 7 is a schematic diagram of another apparatus for Polar codeencoding according to an embodiment of the disclosure.

DETAILED DESCRIPTION OF THE EMBODIMENTS

The technical solutions in embodiments of the disclosure will bedescribed in conjunction with drawings hereinafter.

It should be noted that, numbers such as 101 and 102 involved in theembodiments of the disclosure are only to identify steps of the method,and not to limit the sequence of the numbered steps.

In an aspect, a method for Polar code encoding is provided according toan embodiment of the disclosure. As shown in FIG. 1, the method mayinclude steps 101 to 103.

In 101, each Polar code group in m Polar code groups is represented by acommon information bit set, where Polar codes in each Polar code grouphave a same code length and different code rates and m is greater thanor equal to 2.

Exemplarily, multiple Polar codes with a same code length and differentcode rates may be divided into m Polar code groups, each Polar codegroup includes one or more Polar codes with different code rates, andinformation bit sets respectively corresponding to all Polar codes withdifferent code rates in each Polar code group include at least one sameelement, where m is greater than or equal to 2.

Exemplarily, the code rate of any Polar code is different from eachother. In the embodiment of the disclosure, preferably, Polar codes aredivided so that Polar codes with the code rates being close to eachother are in a Polar code group. The Polar codes may also be divided byusing other division methods, and the embodiment of the disclosure isnot limited herein. It is only required that information bit indexesincluded in the information bit sets corresponding to the Polar codeswith different code rates in each group include at least one sameinformation bit index. The information bit set corresponding to thePolar code is an information bit index set that can be used by the Polarcode, which may be determined by using the method described in thebackground, or may be determined by using other methods, and theembodiment of the disclosure is not limited therein. For example, aninformation bit set corresponding to a Polar code with the code lengthbeing 2048 and the number of information bits being 683 may be A₁, whereA₁ is a subset including 683 elements of a set {0, 1, 2, . . . , 2047};an information bit set corresponding to a Polar code with the codelength being 2048 and the number of information bits being 1024 may beA₂, where A₂ is a subset including 1024 elements of a set {0, 1, 2, . .. , 2047}.

Exemplarily, the Polar codes in each Polar code group may share aninformation bit set or a frozen bit set assigned for the group.

For example, for an i-th Polar code group, the common information bitset assigned for the i-th Polar code group is represented by A_(i), and|A_(i)=K, where |A_(i)| and K_(si) represent the total number ofelements in the common information bit set A_(i) of the i-th Polar codegroup, e.g., K_(s1) represents the total number of elements in thecommon information bit set A₁ of the first Polar code group, and K_(s2)represents the total number of elements in the common information bitset A₂ of the second Polar code group.

Each Polar code in any Polar code group may be represented by a commoninformation bit set of the group. The i-th Polar code group is taken asan example for illustration. Each Polar code in the Polar code group maybe represented by (N,K_(t)), where N is the code length, and K_(t)represents the first K_(t) information bit indexes of the commoninformation bit set A_(i) of the Polar code group. Thus, compared to theconventional technology, overhead for representing Polar codes having asame code length and different code rates is saved.

Exemplarily, the common information bit set A_(i) corresponding to thei-th Polar code group may be a union of information bit setsrespectively corresponding to all Polar codes with different code ratesin the i-th Polar code group, or may be an information bit setcorresponding to a Polar code with a certain code rate in the i-th Polarcode group, or may be obtained by using other methods, and theembodiment of the disclosure is not limited herein. For example, if thei-th Polar code group has three Polar codes, i.e., a Polar code with acode length of 2048 and a code rate of 0.4, a Polar code with a codelength of 2048 and a code rate of 0.5, and a Polar code with a codelength of 2048 and a code rate of 0.6, then the common information bitset of the i-th Polar code group may be an information bit setcorresponding to a code length of 2048 and a code rate of 0.6.

Exemplarily, a recurrence relation is among common information bit setscorresponding to different Polar code groups in the m Polar code groups.

Exemplarily, the recurrence relation may be:

$\left\{ {\begin{matrix}A_{1} \\{A_{i} = {A_{i - 1}\bigcup{\delta\; A_{i}}}}\end{matrix},} \right.$

-   -   where the set A_(i) is a common information bit set        corresponding to the i-th Polar code group, and δA_(i) is a        difference set between the set A_(i) and the set A_(i−1);

Or, the recurrence relation may be:

$\left\{ {\begin{matrix}A_{i} \\{A_{j} = {\left( {A_{i} - {\zeta\; A_{j}}} \right)\bigcup{\delta\; A_{j}}}}\end{matrix},} \right.$

-   -   where the set A_(i) is a common information bit set        corresponding to the i-th Polar code group, the set A_(j) is a        common information bit set corresponding to a j-th Polar code        group, ζA_(j) is a difference set between the set A_(i) and the        set A_(j), and i is not equal to j.

Referring to FIG. 2, A₁ includes elements of K₁, K₂, . . . , K_(s1), A₂includes elements of K_(s1+1), K_(s1+2), . . . , K_(s1+s2), and A_(m)includes elements of K_(sm−1+1), K_(sm−1+2), . . . , K_(sm−1+sm), wherea recurrence relation is among A₁, A₂, . . . , A_(m).

For example, the code length N=16, and A₁, A₂, A₃ correspond to commoninformation bit sets of three Polar code groups respectively,

A₁={16, 15, 14, 12, 9},

A₂={16, 15, 14, 12, 8, 13, 11, 10},

A₃={16, 15, 14, 12, 9, 13, 11, 10, 7, 6, 4},

δA₂={8, 13, 11, 10},

ζA₂={9},

δA₃={9, 7, 6, 4},

ζA₃={8}.

In 102, an information bit set corresponding to each Polar code in thePolar code group is obtained based on the common information bit setcorresponding to the Polar code group.

In a case that Polar codes in each Polar code group share a commoninformation bit set assigned for the group, the information bit setcorresponding to any Polar code (N,K_(t)) in the i-th Polar code groupincludes the first K_(t) information bit indexes of the commoninformation bit set A_(i) of the Polar code group represented by K_(i).

In 103, Polar code encoding is performed on information to be encodedbased on the information bit set corresponding to each Polar code in thePolar code group.

Exemplarily, if the number of bits of the information to be encoded isK, there is a Polar code with a certain code length and a certain coderate that corresponds to the bits of the information to be encoded, thenthe information to be encoded is encoded; if the bits of the informationto be encoded are changed, there is a Polar code with another codelength and another code rate that corresponds to the changed bits ofinformation to be encoded, then the changed information to be encodedmay be encoded.

In the method for Polar code encoding according to the embodiment of thedisclosure, each Polar code group in the m Polar code groups isrepresented by a common information bit set, where Polar codes in eachPolar code group have a same code length and different code rates, and mis greater than or equal to 2; an information bit set corresponding toeach Polar code in the Polar code group is obtained based on the commoninformation bit set corresponding to the Polar code group, and Polarcode encoding is performed on the information to be encoded based on theinformation bit set corresponding to each Polar code in the Polar codegroup. In this way, encoding is performed according to representation ofPolar codes with a same code length and different code rates based ongroups, which greatly reduces the overhead for representing the Polarcodes and addresses the problem of large overhead for representing thePolar codes in the conventional technology, compared with the case thateach Polar code is represented by an independent information bit set.

In another aspect, another method for Polar code encoding is providedaccording to an embodiment of the disclosure. As shown in FIG. 3, themethod may include steps 301 to 303.

In 301, each Polar code group in m Polar code groups is represented by acommon frozen bit set, where Polar codes in each Polar code group have asame code length and different code rates, and m is greater than orequal to 2.

Exemplarily, multiple Polar codes with a same code length and differentcode rates may be divided into m Polar code groups, each Polar codegroup includes one or more Polar codes with different code rates, andfrozen bit sets respectively corresponding to all Polar codes withdifferent code rates in each Polar code group include at least one sameelement, where m is greater than or equal to 2.

Exemplarily, the code rate of any Polar code is different from eachother. In the embodiment of the disclosure, preferably, Polar codes aredivided so that Polar codes with the code rates being close to eachother are in a Polar code group. The Polar codes may also be divided byusing other division methods, and the embodiment of the disclosure isnot limited herein. It is only required that frozen bit indexes includedin the frozen bit sets corresponding to the Polar codes with differentcode rates in each Polar code group include at least one same frozen bitindex. The information bit set corresponding to the Polar code is aninformation bit index set that can be used by the Polar code, which maybe determined by using the method described in background, or may bedetermined by using other methods, and the embodiment of the disclosureis not limited herein. For example, an information bit set correspondingto a Polar code with the code length being 2048 and the number ofinformation bits being 683 may be A₁, where A₁ is a subset including 683elements of a set {0, 1, 2, . . . , 2047}; an information bit setcorresponding to a Polar code with the code length being 2048 and thenumber of information bits being 1024 may be A₂, where A₂ is a subsetincluding 1024 elements of the set {0, 1, 2, . . . , 2047}.

Exemplarily, the Polar codes in each Polar code group may share a frozenbit set assigned for the group. For example, for an i-th Polar codegroup, the common information bit set assigned for the i-th Polar codegroup is represented by A_(i) ^(c), and |A_(i) ^(c)|=K_(si), where|A_(i) ^(c)| and K_(si) represent the total number of elements in thecommon frozen bit set A_(i) ^(c) of the i-th Polar code group.

Each Polar code may be represented based on a common frozen bit set ofthe group. The i-th Polar code group is taken as an example forillustration. Each Polar code in the Polar code group may be representedby (N,K_(t)), where N is the code length, and K_(t) represents the first(N−K_(t)) frozen bit indexes of the common frozen bit set A_(i) ^(c) ofthe group included in the frozen bit set corresponding to the Polarcode. The information bit set A is complementary to the frozen bit setA^(c).

The common frozen bit set A_(i) ^(c) corresponding to the i-th Polarcode group may be a union of frozen bit sets respectively correspondingto all Polar codes with different code rates in the i-th Polar codegroup, or may be a frozen bit set corresponding to a Polar code with acertain code rate in the i-th Polar code group, or may be obtained byusing other methods, and the embodiment of the disclosure is not limitedherein. For example, if the i-th Polar code group has three Polar codes,i.e., a Polar code with a code length of 2048 and a code rate of 0.4, aPolar code with a code length of 2048 and a code rate of 0.5, and aPolar code with a code length of 2048 and a code rate of 0.6, then thecommon frozen bit set corresponding to the first Polar code group may bea frozen bit set corresponding to a code length of 2048 and a code rateof 0.4.

A recurrence relation is among common frozen bit sets corresponding tothe m Polar code groups.

For example, the recurrence relation may be:

$\quad\left\{ \begin{matrix}A_{1}^{c} \\{A_{i}^{c} = {A_{i - 1}^{c}\bigcup{\delta\; A_{i}^{c}}}}\end{matrix} \right.$

-   -   where A_(i) ^(c) is the common frozen bit set corresponding to        the i-th Polar code group, and δA_(i) ^(c) is a difference set        between A_(i) ^(c) and A_(i−1) ^(c);

Or, the recurrence relation may be:

$\quad\left\{ \begin{matrix}A_{i}^{c} \\{A_{j}^{c} = {\left( {A_{i}^{c} - {\zeta\; A_{j}^{c}}} \right)\bigcup{\delta\; A_{j}^{c}}}}\end{matrix} \right.$

-   -   where A_(i) ^(c) is a common frozen bit set corresponding to the        i-th Polar code group, A_(j) ^(c) is a common frozen bit set        corresponding to a j-th Polar code group, δA_(j) ^(c) is a        difference set between the set A_(i) ^(c) and the set A_(j)        ^(c), and i is not equal to j.

In 302, a frozen bit set corresponding to each Polar code in the Polarcode group is obtained based on the common frozen bit set correspondingto the Polar code group.

In a case that the Polar codes in each Polar code group share a commonfrozen bit set assigned for the group, the frozen bit set correspondingto any Polar code (N,K_(t)) in the i-th Polar code group includes thefirst (N−K_(t)) frozen bit indexes of the common frozen bit set A_(i)^(c) of the group.

In 303, Polar code encoding is performed on information to be encodedbased on the frozen bit set corresponding to each Polar code in thePolar code group.

Exemplarily, if the number of bits of the information to be encoded isK, there is a Polar code with a certain code length and a certain coderate that corresponds to the bits of the information, then theinformation to be encoded is encoded; if the bits of the information tobe encoded is changed, there is a Polar code with another code lengthand another code rate that corresponds to the changed bits ofinformation to be encoded, then the changed information to be encodedmay be encoded.

In the method for Polar code encoding according to the embodiment of thedisclosure, each Polar code group in the m Polar code groups isrepresented by a common frozen bit set, where the Polar codes in eachPolar code group have a same code length and different code rates, and mis greater than or equal to 2; a frozen bit set corresponding to eachPolar code in the Polar code group is obtained based on the commonfrozen bit set corresponding to the Polar code group, and Polar codeencoding is performed on the information to be encoded based on thefrozen bit set corresponding to each Polar code in the Polar code group.In this way, encoding is performed according to representation of Polarcodes with a same code length and different code rates based on groups,which greatly reduces the overhead for representing the Polar codes andaddresses the problem of large overhead for representing the Polar codesin the conventional technology, compared with the case that each Polarcode is represented by an independent frozen bit set.

In an aspect, an apparatus 40 for Polar code encoding is providedaccording to an embodiment of the disclosure. The apparatus 40 for Polarcode encoding may be an independent apparatus, or may be located in anindoor baseband processing unit in a base station. Referring to FIG. 4,the apparatus 40 for Polar code encoding includes a representing unit401, an obtaining unit 402, and an encoding unit 403.

The representing unit 401 is configured to represent each Polar codegroup in m Polar code groups by a common information bit set, wherePolar codes in each Polar code group have a same code length anddifferent code rates, and m is greater than or equal to 2.

Exemplarily, the code rate of any Polar code is different from eachother. In the embodiment of the disclosure, preferably, Polar codes aredivided so that Polar codes with the code rates being close to eachother are in a Polar code group. The Polar codes may also be divided byusing other division methods, and the embodiment of the disclosure isnot limited herein. It is only required that information bit indexesincluded in the information bit sets corresponding to the Polar codeswith different code rates in each group include at least one sameinformation bit index. The information bit set corresponding to thePolar code is an information bit index set that can be used by the Polarcode, which may be determined by using the method described inbackground, or may be determined by using other methods, and theembodiment of the disclosure is not limited therein. For example, aninformation bit set corresponding to a Polar code with the code lengthbeing 2048 and the number of information bits being 683 may be A₁, whereA₁ is a subset including 683 elements of a set {0, 1, 2, . . . , 2047};an information bit set corresponding to a Polar code with the codelength being 2048 and the number of information bits being 1024 may beA₂, where A₂ is a subset including 1024 elements of the set {0, 1, 2, .. . , 2047}.

Exemplarily, the Polar codes in each Polar code group may share aninformation bit set or a frozen bit set assigned for the group.

For example, for an i-th Polar code group, the common information bitset assigned for the i-th Polar code group is represented by A_(i), and|A_(i)|=K, where |A_(i)| and K_(si) represent the total number ofelements in the common information bit set A_(i) of the i-th Polar codegroup, e.g., K_(s1) represents the total number of elements in thecommon information bit set A₁ of the first Polar code group, and K_(s2)represents the total number of elements in the common information bitset A₂ of the second Polar code group.

Each Polar code in any Polar code group may be represented by a commoninformation bit set of the group. The i-th Polar code group is taken asan example for illustration. Each Polar code in the Polar code group maybe represented by (N,K_(t)), where N is the code length, and K_(t)represents the first K_(t) information bit indexes of the commoninformation bit set A_(i) of the Polar code group. Thus, compared withthe conventional technology, overhead for representing the Polar codeswith a same code length and different code rates is saved.

Exemplarily, the common information bit set A_(i) corresponding to thei-th Polar code group may be a union of information bit setsrespectively corresponding to all Polar codes with different code ratesin the i-th Polar code group, or may be an information bit setcorresponding to a Polar code with a certain code rate in the i-th Polarcode group, or may be obtained by using other methods, and theembodiment of the disclosure is not limited herein. For example, if thei-th Polar code group has three Polar codes, i.e., a Polar code with acode length of 2048 and a code rate of 0.4, a Polar code with a codelength of 2048 and a code rate of 0.5, and a Polar code with a codelength of 2048 and a code rate of 0.6, then the common information bitset of the i-th Polar code group may be an information bit setcorresponding to a code length of 2048 and a code rate of 0.6.

Exemplarily, a recurrence relation is among common information bit setscorresponding to different Polar code groups in the m Polar code groups.

Exemplarily, the recurrence relation may be:

$\left\{ {\begin{matrix}A_{1} \\{A_{i} = {A_{i - 1}\bigcup{\delta\; A_{i}}}}\end{matrix},} \right.$

-   -   where the set A_(i) is a common information bit set        corresponding to the i-th Polar code group, and δA_(i) is a        difference set between the set A_(i) and the set A_(i−1);

Or, the recurrence relation may be:

$\left\{ {\begin{matrix}A_{i} \\{A_{j} = {\left( {A_{i} - {\zeta\; A_{j}}} \right)\bigcup{\delta\; A_{j}}}}\end{matrix},} \right.$

-   -   where the set A_(i) is a common information bit set        corresponding to the i-th Polar code group, the set A_(j) is a        common information bit set corresponding to a j-th Polar code        group, ζA_(j) is a difference set between the set A_(i) and the        set A_(j), and i is not equal to j.

Referring to FIG. 2, A₁ includes elements of K₁, K₂, . . . , K_(s1), A₂includes elements of K_(s1+1), K_(s1+2), . . . , K_(s1+s2), and A_(m)includes elements of K_(sm−1+1), K_(sm−1+2), . . . , K_(sm−1+sm), wherea recurrence relation is among A₁, A₂, . . . , A_(m).

For example, the code length N=16, and A₁, A₂, A₃ correspond to commoninformation bit sets of three Polar code groups respectively,

-   -   A₁={16, 15, 14, 12, 9},    -   A₂={16, 15, 14, 12, 8, 13, 11, 10},    -   A₃={16, 15, 14, 12, 9, 13, 11, 10, 7, 6, 4},    -   δA₂={8, 13, 11, 10},    -   ζA₂={9},    -   δA₃={9, 7, 6, 4},    -   ζA₃={8}.

The obtaining unit 402 is configured to obtain an information bit setcorresponding to each Polar code in the Polar code group based on thecommon information bit set corresponding to the Polar code group.

In a case that the Polar codes in each Polar code group share a commoninformation bit set assigned for the group, the information bit setcorresponding to any Polar code (N,K_(t)) in the i-th Polar code groupincludes the first K_(t) information bit indexes of the commoninformation bit set A_(i) of the Polar code group represented by K_(t).

The encoding unit 403 is configured to perform Polar code encoding oninformation to be encoded based on the information bit set correspondingto each Polar code in the Polar code group.

Exemplarily, if the number of bits of the information to be encoded isK, there is a Polar code with a certain code length and a certain coderate that corresponds to the bit of information to be encoded, and thenthe information to be encoded is encoded; if bits of the information tobe encoded is changed, there is a Polar code with another code lengthand another code rate that corresponds to the changed bits ofinformation to be encoded, and then the changed information to beencoded may be encoded.

In the apparatus 40 for Polar code encoding according to the embodimentof the disclosure, each Polar code group in the m Polar code groups isrepresented by a common information bit set, where the Polar codes ineach Polar code group have a same code length and different code rates,and m is greater than or equal to 2; an information bit setcorresponding to each Polar code in the Polar code group is obtainedbased on the common information bit set corresponding to the Polar codegroup, and Polar code encoding is performed on the information to beencoded based on the information bit set corresponding to each Polarcode in the Polar code group. In this way, encoding is performedaccording to representation of Polar codes with a same code length anddifferent code rates based on groups, which greatly reduces the overheadfor representing the Polar codes and addresses the problem of largeoverhead for representing the Polar codes in the conventionaltechnology, compared with the case that each Polar code is representedby an independent information bit set.

In an aspect, another apparatus 50 for Polar code encoding is providedaccording to an embodiment of the disclosure. Referring to FIG. 5, theapparatus 50 for Polar code encoding includes a storage 501 and aprocessor 502.

The storage 501 is configured to store Polar codes.

The processor 502 is configured to:

-   -   represent each Polar code group in m Polar code groups by a        common information bit set, where Polar codes in each Polar code        group have a same code length and different code rates, and m is        greater than or equal to 2;    -   obtain an information bit set corresponding to each Polar code        in the Polar code group based on the common information bit set        corresponding to the Polar code group; and    -   perform Polar code encoding on information to be encoded based        on the information bit set corresponding to each Polar code in        the Polar code group.

Exemplarily, the code rate of any Polar code is different from eachother. In the embodiment of the disclosure, preferably, Polar codes aredivided so that Polar codes with the code rates being close to eachother are in a Polar code group. The Polar codes may also be divided byusing other division methods, and the embodiment of the disclosure isnot limited herein. It is only required that information bit indexesincluded in the information bit sets corresponding to the Polar codeswith different code rates in each group include at least one sameinformation bit index. The information bit set corresponding to thePolar code is an information bit index set that can be used by the Polarcode, which may be determined by using the method described inbackground, or may be determined by using other methods, and theembodiment of the disclosure is not limited herein. For example, aninformation bit set corresponding to a Polar code with the code lengthbeing 2048 and the number of information bits being 683 may be A₁, whereA₁ is a subset including 683 elements of a set {0, 1, 2, . . . , 2047};an information bit set corresponding to a Polar code with the codelength being 2048 and the number of information bits being 1024 may beA₂, where A₂ is a subset including 1024 elements of the set {0, 1, 2, .. . , 2047}.

Exemplarily, the Polar codes in each Polar code group may share aninformation bit set or a frozen bit set assigned for the group.

For example, for an i-th Polar code group, the common information bitset assigned for the i-th Polar code group is represented by A_(i), and|A_(i)|=K_(si), where |A_(i)| and K_(si) represent the total number ofelements in the common information bit set A_(i) of the i-th Polar codegroup, e.g., K_(s1) represents the total number of elements in thecommon information bit set A₁ of the first Polar code group, and K_(s2)represents the total number of elements in the common information bitset A₂ of the second Polar code group.

Each Polar code in any Polar code group may be represented by a commoninformation bit set of the group. The i-th Polar code group is taken asan example for illustration. Each Polar code in the Polar code group maybe represented by (N,K_(t)), where N is the code length, and K_(t)represents the first K_(t) information bit indexes of the commoninformation bit set A_(i) of the Polar code group. Thus, compared to theconventional technology, overhead for representing Polar codes with asame code length and different code rates is saved.

Exemplarily, the common information bit set A_(i) corresponding to thei-th Polar code group may be a union of information bit setsrespectively corresponding to all Polar codes with different code ratesin the i-th Polar code group, or may be an information bit setcorresponding to a Polar code with a certain code rate in the i-th Polarcode group, or may be obtained by using other methods, and theembodiment of the disclosure is not limited herein. For example, if thei-th Polar code group has three Polar codes, i.e., a Polar code with acode length of 2048 and a code rate of 0.4, a Polar code with a codelength of 2048 and a code rate of 0.5, and a Polar code with a codelength of 2048 and a code rate of 0.6, then the common information bitset of the i-th Polar code group may be an information bit setcorresponding to a code length of 2048 and a code rate of 0.6.

Exemplarily, a recurrence relation is among common information bit setscorresponding to different Polar code groups in the m Polar code groups.

Exemplarily, the recurrence relation may be:

$\left\{ {\begin{matrix}A_{1} \\{A_{i} = {A_{i - 1}\bigcup{\delta\; A_{i}}}}\end{matrix},} \right.$

-   -   where the set A_(i) is a common information bit set        corresponding to the i-th Polar code group, and δA_(i) is a        difference set between the set A_(i) and the set A_(i−1);

Or, the recurrence relation may be:

$\left\{ {\begin{matrix}A_{i} \\{A_{j} = {\left( {A_{i} - {\zeta\; A_{j}}} \right)\bigcup{\delta\; A_{j}}}}\end{matrix},} \right.$

-   -   where the set A_(i) is a common information bit set        corresponding to the i-th Polar code group, the set A_(j) is a        common information bit set corresponding to a j-th Polar code        group, ζA_(j) is a difference set between the set A_(i) and the        set A_(j), and i is not equal to j.

Referring to FIG. 2, A₁ includes elements of K₁, K₂, . . . , K_(s1), A₂includes elements of K_(s1+1), K_(s1+2), . . . , K_(s1+s2), and A_(m)includes elements of K_(sm−1+1), K_(sm−1+2), . . . , K_(sm−1+sm), wherea recurrence relation is among A₁, A₂, . . . , A_(m).

For example, the code length N=16, and A₁, A₂, A₃ correspond to commoninformation bit sets of three Polar code groups respectively,

-   -   A₁={16, 15, 14, 12, 9},    -   A₂={16, 15, 14, 12, 8, 13, 11, 10},    -   A₃={16, 15, 14, 12, 9, 13, 11, 10, 7, 6, 4},    -   δA₂={8, 13, 11, 10},    -   ζA₂={9},    -   δA₂={9, 7, 6, 4},    -   ζA₃={8}.

In the apparatus 50 for Polar code encoding according to the embodimentof the disclosure, each Polar code group in the m Polar code groups isrepresented by a common information bit set, where the Polar codes ineach Polar code group have a same code length and different code rates,and m is greater than or equal to 2; an information bit setcorresponding to each Polar code in the Polar code group is obtainedbased on the common information bit set corresponding to the Polar codegroup, and Polar code encoding is performed on information to be encodedbased on the information bit set corresponding to each Polar code in thePolar code group. In this way, encoding is performed according torepresentation of Polar codes with a same code length and different coderates based on groups, which greatly reduces the overhead forrepresenting the Polar codes and addresses the problem of large overheadfor representing the Polar codes in the conventional technology,compared with the case that each Polar code is represented by anindependent information bit set.

In an aspect, an apparatus 60 for Polar code encoding is providedaccording to an embodiment of the disclosure. The apparatus 60 for Polarcode encoding may be an independent apparatus, or may be located in anindoor baseband processing unit in a base station. Referring to FIG. 6,the apparatus 60 for Polar code encoding includes a representing unit601, an obtaining unit 602, and an encoding unit 603.

The representing unit 601 is configured to represent each Polar codegroup in m Polar code groups by a common frozen bit set, where Polarcodes in each Polar code group have a same code length and differentcode rates, and m is greater than or equal to 2.

Exemplarily, the code rate of any Polar code is different from eachother. In the embodiment of the disclosure, preferably, Polar code aredivided so that Polar codes with the code rates being close to eachother are in a Polar code group. The Polar codes may also be divided byusing other division methods, and the embodiment of the disclosure isnot limited herein. It is only required that frozen bit indexes includedin the frozen bit sets corresponding to the Polar codes with differentcode rates in each group include at least one same frozen bit index. Theinformation bit set corresponding to the Polar code is an informationbit index set that can be used by the Polar code, which may bedetermined by using the method described in background, or may bedetermined by using other methods, and the embodiment of the disclosureis not limited herein. For example, an information bit set correspondingto a Polar code with the code length being 2048 and the number ofinformation bits being 683 may be A₁, where A₁ is a subset including 683elements of a set {0, 1, 2, . . . , 2047}; an information bit setcorresponding to a Polar code with the code length being 2048 and thenumber of information bits being 1024 may be A₂, where A₂ is a subsetincluding 1024 elements of the set {0, 1, 2, . . . , 2047}.

Exemplarily, the Polar codes in each Polar code group may share a frozenbit set assigned for the group. For example, for an i-th Polar codegroup, the common information bit set assigned for the i-th Polar codegroup is represented by A_(i) ^(c), and |A_(i) ^(c)|=K_(si), where|A_(i) ^(c)| and K_(si) represent the total number of elements in thecommon frozen bit set |A_(i) ^(c)| of the i-th Polar code group.

Each Polar code may be represented based on a common frozen bit set ofthe group. The i-th Polar code group is taken as an example forillustration. Each Polar code in the Polar code group may be representedby (N,K_(t)), where N is the code length, and K_(t) represents the first(N−K_(t)) frozen bit indexes of the common frozen bit set A_(i) ^(c) ofthe group included in the frozen bit set corresponding to the Polarcode. The information bit set A is complementary to the frozen bit setA^(c).

The common frozen bit set |A_(i) ^(c)| corresponding to the i-th Polarcode group may be a union of frozen bit sets respectively correspondingto all Polar codes with different code rates in the i-th Polar codegroup, or may be a frozen bit set corresponding to a Polar code with acertain code rate in the i-th Polar code group, or may be obtained byusing other methods, and the embodiment of the disclosure is not limitedherein. For example, if the i-th Polar code group has three Polar codes,i.e., a Polar code with a code length of 2048 and a code rate of 0.4, aPolar code with a code length of 2048 and a code rate of 0.5, and aPolar code with a code length of 2048 and a code rate of 0.6, then thecommon frozen bit set corresponding to the first Polar code group may bea frozen bit set corresponding to a code length of 2048 and a code rateof 0.4.

A recurrence relation is among common frozen bit sets respectivelycorresponding to the m Polar code groups.

For example, the recurrence relation may be:

$\quad\left\{ \begin{matrix}A_{1}^{c} \\{A_{i}^{c} = {A_{i - 1}^{c}\bigcup{\delta\; A_{i}^{c}}}}\end{matrix} \right.$

-   -   where A_(i) ^(c) is the common frozen bit set corresponding to        the i-th Polar code group, and δA_(i) ^(c) is a difference set        between A_(i) ^(c) and A_(i−1) ^(c);

Or, the recurrence relation may be:

$\quad\left\{ \begin{matrix}A_{i}^{c} \\{A_{j}^{c} = {\left( {A_{i}^{c} - {\zeta\; A_{j}^{c}}} \right)\bigcup{\delta\; A_{j}^{c}}}}\end{matrix} \right.$

-   -   where A_(i) ^(c) is a common frozen bit set corresponding to the        i-th Polar code group, A_(j) ^(c) is a common frozen bit set        corresponding to a j-th Polar code group, δA_(j) ^(c) is a        difference set between the set A_(i) ^(c) and the set A_(j)        ^(c), and i is not equal to j.

The obtaining unit 602 is configured to obtain a frozen bit setcorresponding to each Polar code in the Polar code group based on thefrozen bit set corresponding to the Polar code group.

In a case that the Polar codes in each Polar code group share a commonfrozen bit set assigned for the group, the frozen bit set correspondingto any Polar code (N,K_(t)) in the i-th Polar code group includes thefirst (N−K_(t)) frozen bit indexes of the common frozen bit set A_(i)^(c) of the group.

The encoding unit 603 is configured to perform Polar code encoding oninformation to be encoded based on the frozen bit set corresponding toeach Polar code in the Polar code group.

Exemplarily, if the number of bits of the information to be encoded isK, there is a Polar code with a certain code length and a certain coderate that corresponds to the bits of information to be encoded, and thenthe information to be encoded is encoded; if the bits of the informationto be encoded is changed, there is a Polar code with another code lengthand another code rate that corresponds to the changed bits ofinformation to be encoded, and then the changed information to beencoded may be encoded.

In the apparatus 60 for Polar code encoding according to the embodimentof the disclosure, each Polar code group in the m Polar code groups isrepresented by a common frozen bit set, where the Polar codes in eachPolar code group have a same code length and different code rates, and mis greater than or equal to 2; a frozen bit set corresponding to eachPolar code in the Polar code group is obtained based on the commonfrozen bit set corresponding to the Polar code group, and Polar codeencoding is performed on the information to be encoded based on thefrozen bit set corresponding to each Polar code in the Polar code group.In this way, encoding is performed according to representation of Polarcodes with a same code length and different code rates based on groups,which greatly reduces the overhead for representing the Polar codes andaddresses the problem of large overhead for representing the Polar codesin the conventional technology, compared with the case that each Polarcode is represented by an independent frozen bit set.

In an aspect, another apparatus 70 for Polar code encoding is providedaccording to an embodiment of the disclosure. Referring to FIG. 7, theapparatus 70 for Polar code encoding includes a storage 701 and aprocessor 702.

The storage 701 is configured to store Polar codes.

The processor 702 is configured to:

-   -   represent each Polar code group in m Polar code groups by a        common frozen bit set, where Polar codes in each Polar code        group have a same code length and different code rates, and m is        greater than or equal to 2;    -   obtain a frozen bit set corresponding to each Polar code in the        Polar code group based on the frozen bit set corresponding to        the Polar code group; and    -   perform Polar code encoding on information to be encoded based        on the frozen bit set corresponding to each Polar code in the        Polar code group.

Exemplarily, the code rate of any Polar code is different from eachother. In the embodiment of the disclosure, preferably, Polar codes aredivided so that Polar codes with the code rates being close to eachother are in a Polar code group. The Polar codes may also be divided byusing other division methods, and the embodiment of the disclosure isnot limited herein. It is only required that frozen bit indexes includedin the frozen bit sets corresponding to the Polar codes with differentcode rates in each group include at least one same frozen bit index. Theinformation bit set corresponding to the Polar code is an informationbit index set that can be used by the Polar code, which may bedetermined by using the method described in background, or may bedetermined by using other methods, and the embodiment of the disclosureis not limited herein. For example, an information bit set correspondingto a Polar code with the code length being 2048 and the number ofinformation bits being 683 may be A₁, where A₁ is a subset including 683elements of a set {0, 1, 2, . . . , 2047}; an information bit setcorresponding to a Polar code with the code length being 2048 and thenumber of information bits being 1024 may be A₂, where A₂ is a subsetincluding 1024 elements of the set {0, 1, 2, . . . , 2047}.

Exemplarily, the Polar codes in each Polar code group may share a frozenbit set assigned for the group. For example, for an i-th Polar codegroup, the common information bit set assigned for the i-th Polar codegroup is represented by A_(i) ^(c), and |A_(i) ^(c)|=K_(si), where|A_(i) ^(c)| and K_(si) represent the total number of elements in thecommon frozen bit set A_(i) ^(c) of the i-th Polar code group.

Each Polar code may be represented based on a common frozen bit set ofthe group. The i-th Polar code group is taken as an example forillustration. Each Polar code in the Polar code group may be representedby (N,K_(t)), where N is the code length, and K_(t) represents the first(N−K_(t)) frozen bit indexes of the common frozen bit set A_(i) ^(c) ofthe group included in the frozen bit set corresponding to the Polarcode. The information bit set A is complementary to the frozen bit setA^(c).

The common frozen bit set A_(i) ^(c) corresponding to the i-th Polarcode group may be a union of frozen bit sets corresponding to all Polarcodes with different code rates in the i-th Polar code group, or may bea frozen bit set corresponding to a Polar codes with a certain code ratein the i-th Polar code group, or may be obtained by using other methods,and the embodiment of the disclosure is not limited herein. For example,if the i-th Polar code group has three Polar codes, i.e., a Polar codewith a code length of 2048 and a code rate of 0.4, a Polar code with acode length of 2048 and a code rate of 0.5, and a Polar code with a codelength of 2048 and a code rate of 0.6, then the common frozen bit setcorresponding to the first Polar code group may be a frozen bit setcorresponding to a code length of 2048 and a code rate of 0.4.

A recurrence relation is among common frozen bit sets respectivelycorresponding to the m Polar code groups.

For example, the recurrence relation may be:

$\quad\left\{ \begin{matrix}A_{1}^{c} \\{A_{i}^{c} = {A_{i - 1}^{c}\bigcup{\delta\; A_{i}^{c}}}}\end{matrix} \right.$

-   -   where A_(i) ^(c) is a common frozen bit set corresponding to the        i-th Polar code group, and δA_(i) ^(c) is a difference set        between A_(i) ^(c) and A_(i−1) ^(c);

Or, the recurrence relation may be:

$\quad\left\{ \begin{matrix}A_{i}^{c} \\{A_{j}^{c} = {\left( {A_{i}^{c} - {\zeta\; A_{j}^{c}}} \right)\bigcup{\delta\; A_{j}^{c}}}}\end{matrix} \right.$

-   -   where A_(i) ^(c) is a common frozen bit set corresponding to the        i-th Polar code group, A_(j) ^(c) is a common frozen bit set        corresponding to a j-th Polar code group, δA_(j) ^(c) is a        difference set between the set A_(i) ^(c) and the set A_(j)        ^(c), and i is not equal to j.

In the apparatus 70 for Polar code encoding according to the embodimentof the disclosure, each Polar code group in the m Polar code groups isrepresented by a common frozen bit set, where the Polar codes in eachPolar code group have a same code length and different code rates, and mis greater than or equal to 2; a frozen bit set corresponding to eachPolar code in the Polar code group is obtained based on the commonfrozen bit set corresponding to the Polar code group, and Polar codeencoding is performed on the information to be encoded based on thefrozen bit set corresponding to each Polar code in the Polar code group.In this way, encoding is performed according to representation of Polarcodes with a same code length and different code rates based on groups,which greatly reduces the overhead for representing the Polar codes andaddresses the problem of large overhead for representing the Polar codesin the conventional technology, compared with the case that each Polarcode is represented by an independent frozen bit set.

Those skilled in the art should clearly know that, for convenience andconcision of description, for the operation of the systems, apparatusesand units mentioned above, one can refer to corresponding processes inthe method embodiments, which is not repeated herein.

It should be understood that, in the embodiments of the disclosure, thedisclosed systems, apparatuses and methods may be implemented in otherways. For example, the device embodiments described above are justexemplary. The units are divided based on logical functions, and mayalso be divided in other ways in practical implementation. Multipleunits or components may be combined or integrated into another system,or some features may be ignored or not executed. In addition, thedisplayed or discussed couplings, direct couplings or communicationconnections may be indirect couplings or communication connectionsthrough some interfaces, apparatuses or units, which may be electrical,mechanical or in other forms.

The units described as separate components may be or may not beseparated physically. The components shown as units may be or may not bephysical units, i.e., the units may be located at one place or may bedistributed onto multiple network units. All of or part of the units maybe selected based on actual needs to achieve the purposes according tothe embodiments of the disclosure.

In addition, individual function units according to the embodiments ofthe disclosure may be integrated in one processing unit, or the unitsmay exist separately, or two or more units may be integrated in oneunit. The foregoing integrated units may be realized in a form ofhardware, or realized in a form of combination of hardware and softwarefunctional units.

The integrated unit implemented in the form of software function unitmay be stored in a computer readable storage medium. The softwarefunction unit mentioned above is stored in a storage medium and includesseveral instructions for instructing a computer device (which may be apersonal computer, a server, a network device or the like) to implementpart of the steps of the methods according to the embodiments of thedisclosure. The foregoing storage medium includes various media that canstore program codes, for example, USB disk, mobile hard disk drive,read-only memory (ROM), random access memory (RAM), magnetic disk,optical disk and the like.

It should be noted that, the embodiments mentioned above are only toillustrate the technical solutions of the disclosure, rather than tolimit the scope of the disclosure. Though the disclosure is described indetail according to the embodiments mentioned above, those skilled inthe art should understand that, the technical solution according to theembodiments mentioned above may be modified, or some technical featuresmay be substituted equivalently; and these modifications orsubstitutions do not make the essence of the corresponding technicalsolution depart from the spirit and scope of the technical solutions inthe embodiments of the disclosure.

What is claimed is:
 1. A channel coding method, performed by a codingdevice in a communication system, comprising: obtaining K data bits,wherein K is an integer greater than or equal to 1; obtaining a firstindex set from a common index set, wherein the first index set comprisesK indexes, and the common index set comprises the first index set and asecond index set; polar encoding the K data bits according to the firstindex set, to obtain a first polar code comprising an encoded bitsequence, wherein the encoded bit sequence has a code length of N; andoutputting the first polar code; wherein the first polar code is one ofa plurality of polar codes having same code length N, and the pluralityof polar codes comprises a second polar code, wherein the second polarcode is generated by polar encoding one or more data bits according tothe second index set obtained from the common index set.
 2. The methodaccording to claim 1, wherein the common index set is a union of indexsets respectively corresponding to all polar codes in the plurality ofpolar codes.
 3. The method according to claim 1, wherein the first polarcode and the second polar code have different code rates.
 4. The methodaccording to claim 1, wherein the plurality of polar codes form a groupof polar codes, which is one of m groups of polar codes, and whereinthere is a recurrence relation among common index sets correspondingrespectively to the m groups of polar codes, wherein m is greater thanor equal to
 2. 5. The method according to claim 4, wherein therecurrence relation among the common index sets correspondingrespectively to the m groups of polar codes is: $\left\{ {\begin{matrix}A_{1} \\{A_{i} = {A_{i - 1}\bigcup{\delta\; A_{i}}}}\end{matrix},} \right.$ wherein A_(i) is a common index setcorresponding to an i-th group of polar codes, and δA_(i) is adifference set between A_(i) and A_(i−1).
 6. The method according toclaim 1, wherein the first index set is an information bit index set forpolar encoding the K data bits.
 7. The method according to claim 1,wherein polar encoding the K data bits according to the first index setcomprises: obtaining a K-bit first sequence based on the K data bits andthe first index set; generating a second sequence, wherein the secondsequence comprises N bits, N is an integer power of 2 and is greaterthan K, and K bit-positions of the second sequence are occupied by the Kbits of the first sequence; encoding the second sequence according to anencoding process of x₁ ^(N)=u₁ ^(N)G_(N), wherein G_(N) is a Polar codegenerating matrix of N rows×N columns, u₁ ^(N) is the second sequence,and x₁ ^(N) is the encoded bit sequence.
 8. An apparatus for channelcoding, comprising a processor and a non-transitory storage mediumhaving processor-executable instructions stored thereon that, whenexecuted by the processor, cause the apparatus to: obtain K data bits,wherein K is an integer greater than or equal to 1; obtain a first indexset from a common index set, wherein the first index set comprises Kindexes, and the common index set comprises the first index set and asecond index set; polar encode the K data bits according to the firstindex set, to obtain a first polar code comprising an encoded bitsequence, wherein the encoded bit sequence has a code length of N; andoutput the first polar code; wherein the first polar code is one of aplurality of polar codes having same code length N, the plurality ofpolar codes comprises a second polar code, and the second polar code isgenerated by polar encoding one or more data bits according to thesecond index set obtained from the common index set.
 9. The apparatusaccording to claim 8, wherein the common index set is a union of indexsets respectively corresponding to all polar codes in the plurality ofpolar codes.
 10. The apparatus according to claim 8, wherein the firstpolar code and the second polar code have different code rates.
 11. Theapparatus according to claim 8, wherein the plurality of polar codesform a group of polar codes, which is one of m groups of polar codes,and wherein there is a recurrence relation among common index setscorresponding respectively to the m groups of polar codes, wherein m isgreater than or equal to
 2. 12. The apparatus according to claim 11,wherein the recurrence relation among the common index setscorresponding respectively to the m groups of polar codes is:$\left\{ {\begin{matrix}A_{1} \\{A_{i} = {A_{i - 1}\bigcup{\delta\; A_{i}}}}\end{matrix},} \right.$ wherein A_(i) is a common index setcorresponding to an i-th group of polar codes, and δA_(i) is adifference set between A_(i) and A_(i−1).
 13. The apparatus according toclaim 8, wherein the index set is an information bit index set for polarencoding the K data bits.
 14. The apparatus according to claim 8,wherein in polar encoding the K data bits according to the first indexset, the program instructions cause the apparatus to: obtain a K-bitfirst sequence based on the K data bits and the first index set;generate a second sequence, wherein the second sequence comprises Nbits, N is an integer power of 2 and is greater than K, and Kbit-positions of the second sequence are occupied by the K bits of thefirst sequence; encode the second sequence according to an encodingprocess of x₁ ^(N)=u₁ ^(N)G_(N), wherein G_(N) is a Polar codegenerating matrix of N rows×N columns, u₁ ^(N) is the second sequence,and x₁ ^(N) is the encoded bit sequence.